-
1 map color theorem
Большой англо-русский и русско-английский словарь > map color theorem
-
2 map color theorem
Математика: теорема о раскраске карт -
3 map color theorem
-
4 theorem
- analytical hierarchy theorem - arithmetical hierarchy theorem - closed range theorem - formally provable theorem - implicit function theorem - initial value theorem - integral representation theorem - local limit theorem - maximal ergodic theorem - mean value theorem - normal form theorem - ratio limit theorem - rational root theorem - second mean value theorem - theorem of consistency proofs - theorem of corresponding states - three line theorem - three series theorem - uniform convergence theorem - uniform ergodic theorem - uniform mean value theoremtheorem implies — из теоремы следует, что…
См. также в других словарях:
Four color theorem — Example of a four colored map A four colori … Wikipedia
Five color theorem — The five color theorem is a result from graph theory that given a plane separated into regions, such as a political map of the counties of a state, the regions may be colored using no more than five colors in such a way that no two adjacent… … Wikipedia
Map coloring — is the act of assigning different colors to different features on a map. There are two very different uses of this term. The first is in cartography, choosing the colors to be used when producing a map. The second is in mathematics, where the… … Wikipedia
Theorem — The Pythagorean theorem has at least 370 known proofs[1] In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and previously accepted statements … Wikipedia
Map-coloring games — Several map coloring games are studied in combinatorial game theory. The general idea is that we are given a map with regions drawn in but with not all the regions colored. Two players, Left and Right, take turns coloring in one uncolored region… … Wikipedia
Combinatorial map — A combinatorial map is a combinatorial object modelling topological structures with subdivided objects. Historically, the concept was introduced informally by J. Edmonds for polyhedral surfaces [1] which are planar graphs. It was given its first… … Wikipedia
De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… … Wikipedia
Bivariate map — A bivariate map displays two variables on a single map by combining two different sets of graphic symbols or colors. Bivariate mapping is an important technique in cartography. Given a set of geographic features, a bivariate map displays two… … Wikipedia
four-color problem — /fawr kul euhr, fohr /, Math. the problem, solved in 1976, of proving the theorem that any geographic map can be colored using only four colors so that no connected countries with a common boundary are colored the same color. Also called four… … Universalium
four-color problem — /fawr kul euhr, fohr /, Math. the problem, solved in 1976, of proving the theorem that any geographic map can be colored using only four colors so that no connected countries with a common boundary are colored the same color. Also called four… … Useful english dictionary
Topological map — Topological tube map of the London Underground In cartography and geology, a topological map is one that has been simplified so that only vital information remains and unnecessary detail has been removed. These maps lack scale, and distance and… … Wikipedia